Analysis of Prime Reciprocal Sequences in Base 10
نویسنده
چکیده
Prime reciprocals have applications in coding and cryptography and for generation of random sequences. This paper investigates the structural redundancy of prime reciprocals in base 10 in a manner that parallels an earlier study for binary prime reciprocals. Several different kinds of structural relationships amongst the digits in reciprocal sequences are classified with respect to the digit in the least significant place of the prime. It is also shown that the frequency of digit 0 exceeds that of every other digit when the entire set of prime reciprocal sequences is considered.
منابع مشابه
Testing Kak's Conjecture on Binary Reciprocal of Primes and Cryptographic Applications
This note considers reciprocal of primes in binary representation and shows that the conjecture that 0s exceed 1s in most cases continues to hold for primes less than one million. The conjecture has also been tested for ternary representation with similar results. Some applications of this result to cryptography are discussed. Introduction In a note nearly 25 years ago, Kak conjectured [1] that...
متن کاملRecursive Random Number Generator Using Prime Reciprocals
illustration, the prime reciprocal of 1/7 is , and the prime reciprocal sequence is considered to be 142857. The period of this sequence is 6. Since the maximum length of the period can be (p-1), this is an example of a maximum-length d-sequence. But a prime reciprocal sequence that is maximum length in one base need not be maximum length in another base. Thus the binary prime reciprocal sequen...
متن کاملRandom Sequences for Choosing Base States and Rotations in Quantum Cryptography
This paper investigates the effect of permutations on blocks of a prime reciprocal sequence on its randomness. A relationship between the number of permutations used and the improvement of performance is presented. This can be used as a method for increasing the cryptographic strength of pseudorandom sequences. Keywordsquantum cryptography; autocorrelation functions; d-sequences; randomness
متن کاملA DHT Based Measure of Randomness
This paper presents a new discrete Hilbert transform (DHT) based measure of randomness for discrete sequences. The measure has been used to test three different classes of sequences with satisfactory results. Introduction Random numbers are used in different fields as in cryptography for generating encryption keys, in simulating and modeling complex phenomena and for selecting random samples fr...
متن کاملThe Algebra of Two Dimensional Patterns
One way to create a random array is to map a random sequence into a two-dimensional pattern and an obvious choice is the use of shift-register sequences [10] or to use prime reciprocal sequences [11]-[14]. One dimensional binary random sequences are obtained as expansions of the prime reciprocal 1/p by [11],[12], a(i) = 2 mod p mod 2. Shift register (maximum length) sequences are obtained using...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0801.3841 شماره
صفحات -
تاریخ انتشار 2008